package com.example.offer.no0007;

import java.util.Arrays;

import com.example.offer.no0007.impl.SolutionImpl;

/**
 * 解答测试-重建二叉树
 *
 * @author yumuhui
 */
public class SolutionTest {

    static String s = "";

    public static void main(String[] a1rgs) {

        int[] preorder = new int[]{3, 9, 20, 15, 7};
        int[] inorder = new int[]{9, 3, 15, 20, 7};

        System.out.println("入参: preorder: " + Arrays.toString(preorder));
        System.out.println("入参: inorder: " + Arrays.toString(inorder));

        Solution solution = new SolutionImpl();
        TreeNode treeNode = solution.buildTree(preorder, inorder);
//
        System.out.println(treeNode);
    }
}
